Graph classes with linear Ramsey numbers
نویسندگان
چکیده
منابع مشابه
Graph classes and Ramsey numbers
For a graph class G and any two positive integers i and j, the Ramsey number RG(i, j) is the smallest positive integer such that every graph in G on at least RG(i, j) vertices has a clique of size i or an independent set of size j. For the class of all graphs, Ramsey numbers are notoriously hard to determine, and they are known only for very small values of i and j. Even if we restrict G to be ...
متن کاملOn Geometric Graph Ramsey Numbers
For any two-colouring of the segments determined by 3n− 3 points in general position in the plane, either the first colour class contains a triangle, or there is a noncrossing cycle of length n in the second colour class, and this result is tight. We also give a series of more general estimates on off-diagonal geometric graph Ramsey numbers in the same spirit. Finally we investigate the existen...
متن کاملMultipartite graph - space graph Ramsey numbers
The Ramsey number r(F, G) is the least number N such that in every two-coloring (R, B)=(red, blue) of the edges of KN , either there is a red copy of F or else a blue copy of G . The inequality (1) holds in view of the fact that the edges of the complete graph of order (m-1) (n-1) +s-1 can be given the coloring in which the blue graph, denoted (B), is isomorphic to (m-1)K„_~UKS_~ . Then the red...
متن کاملOn graphs with linear Ramsey numbers
For a ®xed graph H, the Ramsey number r (H ) is de®ned to be the least integer N such that in any 2-coloring of the edges of the complete graph KN, some monochromatic copy of H is always formed. Let H(n, ) denote the class of graphs H having n vertices and maximum degree at most . It was shown by Chvata l, RoÈdl, SzemereÂdi, and Trotter that for each there exists c ( ) such that r (H )< c ( )n...
متن کاملOn Bipartite Graphs with Linear Ramsey Numbers
We provide an elementary proof of the fact that the ramsey number of every bipartite graph H with maximum degree at most ∆ is less than 8(8∆)|V (H)|. This improves an old upper bound on the ramsey number of the n-cube due to Beck, and brings us closer toward the bound conjectured by Burr and Erdős. Applying the probabilistic method we also show that for all ∆≥1 and n≥∆+1 there exists a bipartit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2021
ISSN: 0012-365X
DOI: 10.1016/j.disc.2021.112307